Abstract Left-corner Parsing for Unification Grammars
نویسندگان
چکیده
Left corner Parsing for Uni cation Grammars Noriko Tomuro and Steven L Lytinen DePaul University School of Computer Science Telecommunications and Information Systems S Wabash Ave Chicago IL flytinen tomurog cs depaul edu
منابع مشابه
Left Corner Transforms and Finite State Approximations
This paper describes methods for approximating context-free grammars with finite state machines. Unlike the method derived from the LR(k) parsing algorithm described in Pereira and Wright (1991), these methods use grammar transformations based on the left-corner grammar transform (Rosenkrantz and Lewis II, 1970; Aho and Ullman, 1972). One advantage of the left corner methods is that they genera...
متن کاملCompact non-left-recursive grammars using the selective left-corner transform and factoring
The left-corner transform removes left-recursion from (probabilistic) context-free grammars and unication grammars, permitting simple top-down parsing techniques to be used. Unfortunately the grammars produced by the standard left-corner transform are usually much larger than the original. The selective left-corner transform described in this paper produces a transformed grammar which simulates...
متن کاملImproved Left-Corner Chart Parsing for Large Context-Free Grammars
We develop an improved form of left-corner chart parsing for large context-free grammars, introducing improvements that result in signi cant speed-ups compared to previously-known variants of left-corner parsing. We also compare our method to several other major parsing approaches, and nd that our improved left-corner parsing method outperforms each of these across a range of grammars. Finally,...
متن کاملeft-corner Unification-base
In this paper, we present an efficient algorithm for parsing natural language using unification grammars. The algorithm is an extension of left-corner parsing, a bottom-up algorithm which utilizes top-down expectations. The extension exploits unification grammar’s uniform representation of syntactic, semantic, and domain knowledge, by incorporating all types of grammatical knowledge into parser...
متن کاملMaximizing Top-down Constraints for Unification-based Systems
A left-corner parsing algorithm with topdown filtering has been reported to show very efficient performance for unificationbased systems. However, due to the nontermination of parsing with left-recursive grammars, top-down constraints must be weakened. In this paper, a general method of maximizing top-down constraints is proposed. The method provides a procedure to dynamically compute *restrict...
متن کامل